On metric properties of maps between Hamming spaces and related graph homomorphisms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On metric properties of maps between Hamming spaces and related graph homomorphisms

A mapping of k-bit strings into n-bit strings is called an (α, β)-map if k-bit strings which are more than αk apart are mapped to n-bit strings that are more than βn apart. This is a relaxation of the classical error-correcting codes problem (α = 0). The question is equivalent to existence of graph homomorphisms between certain graphs on the hypercube. Tools based on Schrijver’s θ-function are ...

متن کامل

some properties of fuzzy hilbert spaces and norm of operators

in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...

15 صفحه اول

Metrizability of spaces of homomorphisms between metric vector spaces

Ťhis note tries to give an answer to the following question: Is there a sufficiently rich class of metric vector spaces such that sufficiently large spaces of continuous linear maps between them are metrizable?

متن کامل

Contractive maps in Mustafa-Sims metric spaces

The xed point result in Mustafa-Sims metrical structures obtained by Karapinar and Agarwal[Fixed Point Th. Appl., 2013, 2013:154] is deductible from a corresponding one stated in terms ofanticipative contractions over the associated (standard) metric space.

متن کامل

Graph Homomorphisms between Trees

In this paper we study several problems concerning the number of homomorphisms of trees. We begin with an algorithm for the number of homomorphisms from a tree to any graph. By using this algorithm and some transformations on trees, we study various extremal problems about the number of homomorphisms of trees. These applications include a far reaching generalization and a dual of Bollobás and T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2017

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2016.08.005